European Journal of Combinatorics
نویسندگان
چکیده
A graph X is called almost self-complementary with respect to a perfect matching I if it is isomorphic to the graph obtained from its complement Xc by removing the edges of I. A two-graph on a vertex set Ω is a collection T of 3-subsets of Ω such that each 4-subset of Ω contains an even number of elements of T . In this paper we investigate the relationship between self-complementary two-graphs and double covers over complete graphs that are almost self-complementary with respect to a set of fibres. In particular, we classify all doubly transitive self-complementary two-graphs, and thus all almost self-complementary graphs with an automorphism group acting 2-transitively on the corresponding perfect matching.
منابع مشابه
Modeling Limits in Hereditary Classes: Reduction and Application to Trees
The study of limits of graphs led to elegant limit structures for sparse and dense graphs. This has been unified and generalized by the authors in a more general setting combining analytic tools and model theory to FO-limits (and X-limits) and to the notion of modeling. The existence of modeling limits was established for sequences in a bounded degree class and, in addition, to the case of clas...
متن کاملThe Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کاملA branch-price-and-cut algorithm for the minimum evolution problem
We investigate the Minimum Evolution Problem (MEP), an NP-hard network design problem arising from computational biology. TheMEP consists in finding aweighted unrooted binary tree having n leaves, minimal length, and such that the sum of the edge weights belonging to the unique path between each pair of leaves is greater than or equal to a prescribed value. We study the polyhedral combinatorics...
متن کاملAnalyzing the European Union citizenship through feminist perspectives
The European Union has aspired to create an “ever closer union” among its people since the articulation of the European Union citizenship has been an important instrument towards it. However, attempts at creating this “ever closer union” have focused on homogenizing European citizens as a single entity without taking into account the heterogeneous differentials among such citizens. Gender diffe...
متن کاملThe Twelfth International Conference on Permutation Patterns, 2014
The Steering Committee decided to approach the Editors of the Australasian Journal of Combinatorics with a proposal to publish selected refereed papers from the conference. We were delighted when the proposal was accepted, and the Australasian Journal of Combinatorics joined other journals such as Advances in Applied Mathematics, Annals of Combinatorics, Electronic Journal of Combinatorics, Jou...
متن کاملOn Suborbital Graphs for the Normalizer of Γ0(N)
In this study, we deal with the conjecture given in [R. Keskin, Suborbital graph for the normalizer of Γ0(m), European Journal of Combinatorics 27 (2006) 193206.], that when the normalizer of Γ0(N) acts transitively on Q ∪ {∞}, any circuit in the suborbital graph G(∞, u/n) for the normalizer of Γ0(N), is of the form v → T (v) → T (v) → · · · → T (v) → v, where n > 1, v ∈ Q ∪ {∞} and T is an ell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005